package a09_贪心算法;

/**
 * <p>
 * a06_买卖股票的最佳时机2复习2
 * </p>
 *
 * @author flyduck
 * @since 2025/2/13
 */
public class a06_买卖股票的最佳时机2复习2 {
    public int maxProfit(int[] prices) {
        int sum = 0;
        for (int i = 1; i < prices.length; i++) {
            if(prices[i] > prices[i-1]){
                sum += prices[i] - prices[i-1];
            }
        }
        return sum;
    }
}
